package com.cbd.basic.leetcode.easy;

import lombok.extern.slf4j.Slf4j;

/**
 * 删除有序数组中的重复项
 */
@Slf4j
public class Solution26 {
    public static void main(String[] args) {
        int[] nums = new int[]{0,0,1,1,1,2,2,3,3,4,4};
        int result = removeDuplicates(nums);
        log.info("result = {}, {}", result, nums);
    }

    public static int removeDuplicates(int[] nums) {
        for (int i = 0; i < nums.length; i++) {
            if (nums[i+1] == nums[i]) {
            }
        }
        
        int i = nums.length - 1;
        
        
        while (i >= 0) {
            if (nums[i-1] == nums[i]) {

            }
        }

        return 1;
    }
}
